Cryptanalysis and Improvement of Ye et al’s Quantum Private Comparison Protocol

Recently, Ye et al. (Int. J. Theor. Phys. 56, 1517–1529, 2017) proposed a quantum private comparison (QPC) protocol based on five-qubit entanglement state. Two parties can verify that their secret information is equal or not with the help of the semi-honest third party (TP). However, in this paper we will point out the Ye et al.’s initial protocol is not safe under a special participant attack. That is a malicious participant can get the other party’s secret input information illegally under the forgery attack. Furthermore, we give two possible improvement protocols, which can perform this protocol secure against this kind of attack.

     

Enhanced alternating energy minimization methods for stochastic galerkin matrix equations

BIT Numerical Mathematics - In uncertainty quantification, it is commonly required to solve a forward model consisting of a partial differential equation (PDE) with a spatially varying uncertain...     

Variations of the Catalan numbers from some nonassociative binary operations

We investigate certain nonassociative binary operations that satisfy a four-parameter generalization of the associative law. From this we obtain variations of the ubiquitous Catalan numbers and connections to many interesting combinatorial objects such as binary trees, plane trees, lattice paths, and permutations.     

An infeasible-start framework for convex quadratic optimization,with application to constraint-reduced interior-point and other methods

Mathematical Programming - A framework is proposed for solving general convex quadratic programs (CQPs) from an infeasible starting point by invoking an existing feasible-start algorithm tailored...